Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
نویسندگان
چکیده
It is a well-known theorem by Chomsky and Schützenberger (1963) that every context-free language can be represented as a homomorphic image of the intersection of a Dyck language and a regular language. This paper gives a Chomsky-Schützenberger-type characterization for multiple context-free languages, which are a natural extension of context-free languages, with introducing the notion of multiple Dyck languages, which are also a generalization of Dyck languages.
منابع مشابه
A Chomsky-Schützenberger Representation for Weighted Multiple Context-free Languages
We prove a Chomsky-Schützenberger representation theorem for weighted multiple context-free languages.
متن کاملMultidimensional trees and a Chomsky-Schützenberger-Weir representation theorem for simple context-free tree grammars
Weir [43] proved a Chomsky-Schützenberger-like representation theorem for the string languages of tree-adjoining grammars, where the Dyck language Dn in the Chomsky-Schützenberger characterization is replaced by the intersection D2n ∩ g(D2n), where g is a certain bijection on the alphabet consisting of 2n pairs of brackets. This paper presents a generalization of this theorem to the string lang...
متن کاملMonoid Automata for Displacement Context-Free Languages
In 2007 Kambites presented an algebraic interpretation of Chomsky-Schützenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the class of displacement context-free languages which are equivalent to well-nested multiple context-free languages. We also obtain a characterization of kdisplacement context-free languages in terms of monoid automata a...
متن کاملRepresentations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems
Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of ...
متن کاملThe Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure of a semiring, but recently also other weight computations like average have been considered. Here, we investigate quantitative context-free languages over very general weight structures incorporating all semirings, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010